Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra
نویسندگان
چکیده
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and other fields. We show how to triangulate simple domains using completely well-centered tetrahedra. The domains we consider here are space, infinite slab, infinite rectangular prism, cube, and regular tetrahedron. We also demonstrate single tetrahedra with various combinations of the properties of dihedral acuteness, 2-well-centeredness, and 3-well-centeredness.
منابع مشابه
Perturbing Slivers in 3D Delaunay Meshes
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay for simplicity. The solution which explicitly perturbs the slivers through random vertex relocation and ...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Meshing 3D domains bounded by piecewise smooth surfaces
This report provides an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle as well subdivisions of the domain forming non manifold surfaces. The boundaries and constraints are assumed to be described as a complex formed by a set of vertices, a set of curved segments and a set of surface patches. Each curve segment is assumed to be a piece of a closed smo...
متن کاملShape Segmentation and Matching from Noisy Point Clouds
We present the implementation results of a shape segmentation technique and an associated shape matching method whose input is a point sample from the shape. The sample is allowed to be noisy in the sense that they may scatter around the boundary of the shape instead of lying exactly on it. The algorithm is simple and mostly combinatorial in that it builds a single data structure, the Delaunay ...
متن کاملGenerating Well-Shaped Delaunay Meshes in 3D
A triangular mesh in 3D is a decomposition of a given geometric domain into tetrahedra. The mesh is wellshaped if the aspect ratio of every of its tetrahedra is bounded from above by a constant. It is Delaunay if the interior of the circum-sphere of each of its tetrahedra does not contain any other mesh vertices. Generating a well-shaped Delaunay mesh for any 3D domain has been a long term outs...
متن کاملVoronoi Features Cut for Surface Reconstruction from Multiple Views
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require some knowledge of the scene extent and often even of its approximate geometry (e.g.visual hull). This makes these approaches mainly suited to compact objects admitting a tight enclosing box, imaged on a simple or a known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008